Optimal random search using limited spatial memory
نویسندگان
چکیده
منابع مشابه
OPTIMAL DESIGN OF DIAGRID MODULES BY PSEUDO RANDOM DIRECTIONAL SEARCH
The present work reveals a problem formulation to minimize material consumption and improve efficiency of diagrids to resist equivalent wind loading. The integrated formulation includes not only sizing of structural members but also variation in geometry and topology of such a system. Particular encoding technique is offered to handle practical variation of diagrid modules. A variant of Pseudo-...
متن کاملSolving Limited Memory Influence Diagrams Using Branch-and-Bound Search
A limited-memory influence diagram (LIMID) is a generalization of a traditional influence diagram in which the assumptions of regularity and no-forgetting are relaxed. Lauritzen and Nilsson (2001) introduced this model and proposed an iterative algorithm, called single policy updating (SPU), that converges to a locally optimal solution. In this paper, we describe a branch-andbound algorithm tha...
متن کاملOptimal Allocation of Very Limited Search Resources
This paper presents a probabilistic model for studying the question: given n search resources, where in the search tree should they be ezpended? Specifically, a least-cost root-to-leaf path is sought in a random tree. The tree is known to be binary and complete to depth N. Arc costs are independently set either to 1 (with probability p ) or to 0 (with probability l-p ). The cost of a leaf is th...
متن کاملHeuristic Search with Limited Memory By
HEURISTIC SEARCH WITH LIMITED MEMORY by Matthew Hatem University of New Hampshire, May, 2014 Heuristic search algorithms are commonly used for solving problems in artificial intelligence. Unfortunately, the memory requirement of A*, the most widely used heuristic search algorithm, is often proportional to its running time, making it impractical for large problems. Several techniques exist for s...
متن کاملOptimal Stratification Using Random Search Method in Agricultural Surveys
Lednicki and Wieczorkowski (2003) presented a method of stratification in subpopulations, based on the paper of Rivest (2002), which leads to obtain a fixed precision of a considered estimator for the particular subpopulations. They solved such a problem using a numerical simplex method of Nelder and Mead (1965). Because it is not the best solution of the question, (in a sense of an optimality ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Royal Society Open Science
سال: 2018
ISSN: 2054-5703
DOI: 10.1098/rsos.171057